Spectrum based fraud detection in social networks.

Reconstruction from Randomized Graph via Low Rank Approximation.

On Link Privacy in Randomizing Social Networks.

On Randomness Measures for Social Networks.

Graph Generation with Prescribed Feature Constraints.

On the Quantification of Identity and Link Disclosures in Randomizing Social Networks.

Privacy Preserving Categorical Data Analysis with Unknown Distortion Parameters.

On Addressing Accuracy Concerns in Privacy Preserving Association Rule Mining.

Randomizing Social Networks a Spectrum Preserving Approach.
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and the links among them denote their relationships. Many applications of networks such as anonymous Web browsing require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of the relationship. One general approach for this problem is to randomize the edges in true networks, and only disclose the randomized networks. In this paper, we investigate how various properties of networks may be affected due to randomization. Specifically, we focus on the spectrum since the eigenvalues of a network are intimately connected to many important topological features. We also conduct theoretical analysis on the extent to which edge anonymity can be achieved. A spectrum preserving graph randomization method, which can better preserve network properties while protecting edge anonymity, is then presented and empirically evaluated. 1
Protecting business intelligence and customer privacy while outsourcing data mining tasks.

Determining error bounds for spectral filtering based reconstruction methods in privacy preserving data mining.

Deriving Private Information from Arbitrarily Projected Data.

Privacy Preserving Market Basket Data Analysis.

Privacy Preserving Database Generation for Database Application Testing.

Preserving privacy in association rule mining with bloom filters.

Deriving Private Information from Perturbed Data Using IQR Based Approach.

An Approach to Outsourcing Data Mining Tasks while Protecting Business Intelligence and Customer Privacy.



On the Lower Bound of Reconstruction Error for Spectral Filtering Based Privacy Preserving Data Mining.

Disclosure Analysis for Two%2DWay Contingency Tables.

Towards value disclosure analysis in modeling general databases.

On the use of spectral filtering for privacy preserving data mining.

Incorporating large unlabeled data to enhance EM classification.

Exploring gene causal interactions using an enhanced constraint%2Dbased method.

Approximate Inverse Frequent Itemset Mining Privacy

Privacy Aware Data Generation for Testing Database Applications.

Statistical Database Modeling for Privacy Preserving Database Generation.

Efficient Causal Interaction Learning with Applications in Microarray.


Privacy Aware Market Basket Data Set Generation A Feasible Approach for Inverse Frequent Set Mining.


Privacy Preserving Data Generation for Database Application Performance Testing.
Abstract. Synthetic data plays an important role in software testing. In this paper, we initiate the study of synthetic data generation models for the purpose of application software performance testing. In particular, we will discuss models for protecting privacy in synthetic data generations. Within this model, we investigate the feasibility and techniques for privacy preserving synthetic database generation that can be used for database application performance testing. The methodologies that we will present will be useful for general privacy preserving software performance testing. 1
Interactive Analysis of Gene Interactions Using Graphical gaussian model.
DNA microarray provides a powerful basis for analysis of gene expression. Data mining methods such as clustering have been widely applied to microarray data to link genes that show similar expression patterns. However, this approach usually fails to unveil gene-gene interactions in the same cluster. Association rule mining and loglinear models have been used for this purpose, but their inherent limitations as well as information loss due to discretization limit the applicability of the results. Here we propose the use of a Graphical Gaussian Model to discover pairwise gene interactions. We have constructed a prototype system that permits rapid interactive exploration of gene relationships; results can be validated by experts or known information, or suggest new experiments. We have tested our methodology using the yeast microarray data. Our results reveal some previously unknown interactions that have solid biological explanations.
Compressing High Dimensional Datasets by Fractals.

Screening and interpreting multi%2Ditem associations based on log%2Dlinear modeling.

Privacy preserving database application testing.
Traditionally, application software developers carry out their tests on their own local development databases. However, such local databases usually have only a small number of sample data and hence cannot simulate satisfactorily a live environment, especially in terms of performance and scalability testing. On the other hand, the idea of testing applications over live production databases is increasingly problematic in most situations primarily due to the fact that such use of live production databases has the potential to expose sensitive data to an unauthorized tester and to incorrectly update information in the underlying database. In this paper, we investigate techniques to generate mock databases for application software testing without revealing any confidential information from the live production databases. Specifically, we will design mechanisms to create the deterministic rule set R, non-deterministic rule set N R, and statistic data set S for a live production database. We will then build a security Analyzer which will process the triplet 〈R, N R, S 〉 together with security requirements (security policy) and output a new triplet 〈R ′ , N R ′ , S ′ 〉. The security Analyzer will guarantee that no confidential information could be inferred from the new triplet 〈R ′ , N R ′ , S ′ 〉. The mock database generated from this new triplet can simulate the live environment for testing purpose, while maintaining the privacy of data in the original database.
An Approximate Median Polish Algorithm for Large Multidimensional Data Sets.

An Approximate Median Polish Algorithm for Large Multidimensional Data Sets.



Modeling and Imputation of Large Incomplete Multidimensional Datasets.

B%2DEM a classifier incorporating bootstrap with EM approach for data mining.

Learning missing values from summary constraints.

Finding Dense Clusters in Hyperspace An Approach Based on Row Shuffling.

Loglinear%2DBased Quasi Cubes.

Using Loglinear Models to Compress Datacube.
A data cube is a popular organization for summary data. A cube is simply a multidimensional structure that contains in each cell an aggregate value, i.e., the result of applying an aggregate function to an underlying relation. In practical situations, cubes can require a large amount of storage, so, compressing them is of practical importance. In this paper, we propose an approximation technique that reduces the storage cost of the cube at the price of getting approximate answers for the queries posed against the cube. The idea is to characterize regions of the cube by using statistical models whose description take less space than the data itself. Then, the model parameters can be used to estimate the cube cells with a certain level of accuracy. To increase the accuracy, some of the &#034;outliers,&#034; i.e., cells that incur in the largest errors when estimated are retained. The storage taken by the model parameters and the retained cells, of course, should take a fraction of the space of the...
Using Approximations to Scale Exploratory Data Analysis in Datacubes.
Exploratory Data Analysis is a widely used technique to determine which factors  have the most influence on data values in a multi-way table, or which cells in the table  can be considered anomalous with respect to the other cells. In particular, median  polish is a simple, yet robust method to perform Exploratory Data Analysis. Median  polish is resistant to holes in the table (cells that have no values), but it may require  a lot of iterations through the data. This factor makes it difficult to apply median  polish to large multidimensional tables, since the I/O requirements may be prohibitive.  This paper describes a technique that uses median polish over an approximation of a  datacube, easing the burden of I/O. The results obtained are tested for quality, using a  variety of measures. The technique scales to large datacubes and proves to give a good  approximation of the results that would have been obtained by median polish in the  original data.  1 Introduction  Exploratory Data...
The Role of Approximations in Maintaining and Using Aggregate Views.

